Exploiting nested task-parallelism in the H-LU factorization
نویسندگان
چکیده
منابع مشابه
Exploiting Fine-Grain Parallelism in Recursive LU Factorization
The LU factorization is an important numerical algorithm for solving system of linear equations in science and engineering and is characteristic of many dense linear algebra computations. It has even become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected in the TOP500 website. In this context, the challen...
متن کاملScalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization
ILU(k) is an important preconditioner widely used in many linear algebra solvers for sparse matrices. Unfortunately, there is still no highly scalable parallel ILU(k) algorithm. This paper presents the first such scalable algorithm. For example, the new algorithm achieves 50 times speedup with 80 nodes for general sparse matrices of dimension 160,000 that are diagonally dominant. The algorithm ...
متن کاملHypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several important properties. It takes a global perspective of the entire matrix, as opposed to local heuristics. It takes into account the assymetry of the input matrix by using a hypergraph to represent its structure. It is ...
متن کاملExploiting Task-Level Parallelism Using pTask
This paper presents pTask— a system that allows users to automatically exploit dynamic task-level parallelism in sequential array-based C programs. The system employs compiler analysis to extract data usage information from the program, then uses this information at run-time to dynamically exploit concurrency and to enforce data-dependences. Experimental results using a prototype of the system ...
متن کاملParallelizing LU Factorization
Systems of linear equations can be represented by matrix equations of the form A~x = ~b. LU Factorization is a method for solving systems in this form by transforming the matrix A into a form that makes backwards and forward susbstitution feasible. A common algorithm for LU factorization is Gaussian elimination, which I used for my serial and parallel implementations. I investigated using async...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Science
سال: 2019
ISSN: 1877-7503
DOI: 10.1016/j.jocs.2019.02.004